乳腺癌是女性最常见的恶性肿瘤，每年负责超过50万人死亡。因此，早期和准确的诊断至关重要。人类专业知识是诊断和正确分类乳腺癌并定义适当的治疗，这取决于评价不同生物标志物如跨膜蛋白受体HER2的表达。该评估需要几个步骤，包括免疫组织化学或原位杂交等特殊技术，以评估HER2状态。通过降低诊断中的步骤和人类偏差的次数的目标，赫洛挑战是组织的，作为第16届欧洲数字病理大会的并行事件，旨在自动化仅基于苏木精和曙红染色的HER2地位的评估侵袭性乳腺癌的组织样本。评估HER2状态的方法是在全球21个团队中提出的，并通过一些提议的方法实现了潜在的观点，以推进最先进的。

Testing Deep Learning (DL) based systems inherently requires large and representative test sets to evaluate whether DL systems generalise beyond their training datasets. Diverse Test Input Generators (TIGs) have been proposed to produce artificial inputs that expose issues of the DL systems by triggering misbehaviours. Unfortunately, such generated inputs may be invalid, i.e., not recognisable as part of the input domain, thus providing an unreliable quality assessment. Automated validators can ease the burden of manually checking the validity of inputs for human testers, although input validity is a concept difficult to formalise and, thus, automate. In this paper, we investigate to what extent TIGs can generate valid inputs, according to both automated and human validators. We conduct a large empirical study, involving 2 different automated validators, 220 human assessors, 5 different TIGs and 3 classification tasks. Our results show that 84% artificially generated inputs are valid, according to automated validators, but their expected label is not always preserved. Automated validators reach a good consensus with humans (78% accuracy), but still have limitations when dealing with feature-rich datasets.

Continual Learning, also known as Lifelong or Incremental Learning, has recently gained renewed interest among the Artificial Intelligence research community. Recent research efforts have quickly led to the design of novel algorithms able to reduce the impact of the catastrophic forgetting phenomenon in deep neural networks. Due to this surge of interest in the field, many competitions have been held in recent years, as they are an excellent opportunity to stimulate research in promising directions. This paper summarizes the ideas, design choices, rules, and results of the challenge held at the 3rd Continual Learning in Computer Vision (CLVision) Workshop at CVPR 2022. The focus of this competition is the complex continual object detection task, which is still underexplored in literature compared to classification tasks. The challenge is based on the challenge version of the novel EgoObjects dataset, a large-scale egocentric object dataset explicitly designed to benchmark continual learning algorithms for egocentric category-/instance-level object understanding, which covers more than 1k unique main objects and 250+ categories in around 100k video frames.

This work studies networked agents cooperating to track a dynamical state of nature under partial information. The proposed algorithm is a distributed Bayesian filtering algorithm for finite-state hidden Markov models (HMMs). It can be used for sequential state estimation tasks, as well as for modeling opinion formation over social networks under dynamic environments. We show that the disagreement with the optimal centralized solution is asymptotically bounded for the class of geometrically ergodic state transition models, which includes rapidly changing models. We also derive recursions for calculating the probability of error and establish convergence under Gaussian observation models. Simulations are provided to illustrate the theory and to compare against alternative approaches.

We study a natural extension of classical empirical risk minimization, where the hypothesis space is a random subspace of a given space. In particular, we consider possibly data dependent subspaces spanned by a random subset of the data, recovering as a special case Nystrom approaches for kernel methods. Considering random subspaces naturally leads to computational savings, but the question is whether the corresponding learning accuracy is degraded. These statistical-computational tradeoffs have been recently explored for the least squares loss and self-concordant loss functions, such as the logistic loss. Here, we work to extend these results to convex Lipschitz loss functions, that might not be smooth, such as the hinge loss used in support vector machines. This unified analysis requires developing new proofs, that use different technical tools, such as sub-gaussian inputs, to achieve fast rates. Our main results show the existence of different settings, depending on how hard the learning problem is, for which computational efficiency can be improved with no loss in performance.

3D Flash LiDAR是传统扫描激光雷达系统的替代方法，有望在紧凑的外形尺寸中进行精确的深度成像，并且没有运动部件，例如自动驾驶汽车，机器人技术和增强现实（AR）等应用。通常在图像传感器格式中使用单光子，直接飞行时间（DTOF）接收器实施，设备的操作可能会受到需要在室外场景中处理和压缩的大量光子事件的阻碍以及对较大数组的可扩展性。我们在这里提出了一个64x32像素（256x128 spad）DTOF成像器，该成像器通过将像素与嵌入式直方图使用像素一起克服这些局限性，该直方直方图锁定并跟踪返回信号。这大大降低了输出数据帧的大小，可在10 kfps范围内或100 kfps的最大帧速率进行直接深度读数。该传感器可选择性地读数检测表面或传感运动的像素，从而减少功耗和片外处理要求。我们演示了传感器在中端激光雷达中的应用。

我们介绍了de bruijn图神经网络（DBGNNS），这是一种新颖的时间感知图神经网络体系结构，用于动态图上的时间分辨数据。我们的方法解释了动态图的因果拓扑中展开的时间流行模式，该模式由因果步行确定，即节点可以随着时间的时间影响彼此的链接序列。我们的架构建立在多层de bruijn图的多层上，这是一个迭代的线图结构，其中d de bruijn图中的节点k表示长度k-1的步行，而边缘则表示长度k的步行。我们开发了一个图形神经网络体系结构，该架构利用de bruijn图来实现遵循非马克维亚动力学的消息传递方案，该方案使我们能够在动态图的因果拓扑中学习模式。解决de bruijn图形不同订单k的问题可用于建模相同的数据集，我们进一步应用统计模型选择以确定用于消息传递的最佳图形拓扑。合成和经验数据集的评估表明，DBGNN可以利用动态图中的时间模式，从而大大改善了监督节点分类任务中的性能。

在本文中，我们考虑了分散的优化问题，在这些问题中，代理具有个人成本函数，以最大程度地减少受到子空间约束的约束，这些子空间约束需要整个网络的最小化器才能位于低维子空间中。这种约束的公式包括共识或单任务优化作为特殊情况，并允许更一般的任务相关性模型，例如多任务平滑度和耦合优化。为了应对沟通限制，我们提出并研究一种自适应分散策略，在该策略中，代理人在与邻居进行交流之前，使用差异随机量化器来压缩其估计。分析表明，在量化噪声的某些一般条件下，对于足够小的步长$ \ mu $，该策略在均方误差和平均比特率方面都是稳定的：通过减少$ \ mu $，可以将估计错误保持较小（按$ \ mu $）保持较小，而不会无限地增加比特率为$ \ mu \ rightarrow 0 $。模拟说明了理论发现和提议方法的有效性，表明可以实现分散学习，但仅需少量。

我们提出了一种系统解决方案，以实现使用热图像和惯性测量的飞行机器人团队的数据效率，分散的状态估计。每个机器人可以独立飞行，并在可能的情况下交换数据以完善其状态估计。我们的系统前端应用在线光度校准以完善热图像，从而增强功能跟踪并放置识别。我们的系统后端使用协方差融合策略来忽略代理之间的互相关，以降低内存使用和计算成本。通信管道使用本地汇总的描述符（VLAD）的向量来构建需要较低带宽使用情况的请求响应策略。我们在合成数据和现实世界数据上测试我们的协作方法。我们的结果表明，相对于个人代理方法，该提出的方法最多可提高46％的轨迹估计，同时减少多达89％的通信交换。数据集和代码将发布给公众，扩展了已经发布的JPL XVIO库。

可以使用几种技术来解决沿规定路径的最佳运动计划，但是大多数技术没有考虑到与环境接触时最终效用器所施加的扳手。当无法获得环境的动态模型时，就不存在合并方法来考虑相互作用的效果。无论要优化的特定性能指数如何，本文都提出了一种策略，将外部扳手包括在最佳计划算法中，考虑到任务规格。此过程是针对最小时间轨迹实例化的，并在接纳控制下执行交互任务的真实机器人进行了验证。结果证明，最终效应器扳手的包含会影响计划的轨迹，实际上改变了操纵器的动态能力。